0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.33 % Computer : n002.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1920 0.11/0.33 % WCLimit : 240 0.11/0.33 % DateTime : Wed Jul 30 02:53:34 EDT 2025 0.11/0.33 % CPUTime : 0.19/0.47 Running higher-order theorem proving 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.Gip0EnZJpb/E---3.1_23190.p 0.19/0.51 # Version: 3.0.0-ho 0.19/0.51 # Preprocessing class: HSSSSMSSSSMNHHA. 0.19/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.51 # Starting post_as_ho5 with 1200s (5) cores 0.19/0.51 # Starting sh2lt with 240s (1) cores 0.19/0.51 # Starting ehoh_best8_lambda with 240s (1) cores 0.19/0.51 # Starting post_as_ho10 with 240s (1) cores 0.19/0.51 # post_as_ho5 with pid 23268 completed with status 9 0.19/0.51 # sh2lt with pid 23269 completed with status 0 0.19/0.51 # Result found by sh2lt 0.19/0.51 # Preprocessing class: HSSSSMSSSSMNHHA. 0.19/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.51 # Starting post_as_ho5 with 1200s (5) cores 0.19/0.51 # Starting sh2lt with 240s (1) cores 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.19/0.51 # Search class: HHHSS-FFSF11-SHHFFSBN 0.19/0.51 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.19/0.51 # Starting ehoh_best8_lambda with 130s (1) cores 0.19/0.51 # ehoh_best8_lambda with pid 23279 completed with status 0 0.19/0.51 # Result found by ehoh_best8_lambda 0.19/0.51 # Preprocessing class: HSSSSMSSSSMNHHA. 0.19/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.51 # Starting post_as_ho5 with 1200s (5) cores 0.19/0.51 # Starting sh2lt with 240s (1) cores 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.19/0.51 # Search class: HHHSS-FFSF11-SHHFFSBN 0.19/0.51 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.19/0.51 # Starting ehoh_best8_lambda with 130s (1) cores 0.19/0.51 # Preprocessing time : 0.001 s 0.19/0.51 # Presaturation interreduction done 0.19/0.51 0.19/0.51 # Proof found! 0.19/0.51 # SZS status Theorem 0.19/0.51 # SZS output start CNFRefutation 0.19/0.51 thf(decl_23, type, epred1_0: $i > $o). 0.19/0.51 thf(decl_24, type, esk1_1: (($i > $i) > $o) > $i > $i). 0.19/0.51 thf(decl_25, type, esk2_1: (($i > $i) > $o) > $i > $i). 0.19/0.51 thf(decl_26, type, esk3_1: (($i > $i) > $o) > $i). 0.19/0.51 thf(decl_27, type, esk4_1: (($i > $i) > $o) > $i > $i). 0.19/0.51 thf(decl_28, type, esk5_0: $i > $i). 0.19/0.51 thf(cTHM112A_pme, conjecture, ![X1:$i > $o]:(?[X2:($i > $i) > $o]:(((X2 @ (^[X3:$i]:(X3)))&![X4:$i > $i, X5:$i > $i]:((((X2 @ (^[X3:$i]:(X4 @ (X5 @ X3))))&![X6:$i]:(((X1 @ X6)=>(X1 @ (X4 @ X6)))))<=((X2 @ X4)&(X2 @ X5))))))), file('/export/starexec/sandbox2/tmp/tmp.Gip0EnZJpb/E---3.1_23190.p', cTHM112A_pme)). 0.19/0.51 thf(c_0_1, negated_conjecture, ~(![X1:$i > $o]:(?[X2:($i > $i) > $o]:(((X2 @ (^[Z0/* 0 */:$i]:(Z0)))&![X4:$i > $i, X5:$i > $i]:((((X2 @ X4)&(X2 @ X5))=>((X2 @ (^[Z0/* 17 */:$i]:(X4 @ (X5 @ Z0))))&![X6:$i]:(((X1 @ X6)=>(X1 @ (X4 @ X6))))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM112A_pme])])])). 0.19/0.51 thf(c_0_2, negated_conjecture, ![X13:($i > $i) > $o]:(((((X13 @ (esk1_1 @ X13))|~(X13 @ (^[Z0/* 0 */:$i]:(Z0))))&((X13 @ (esk2_1 @ X13))|~(X13 @ (^[Z0/* 0 */:$i]:(Z0)))))&(((epred1_0 @ (esk3_1 @ X13))|~(X13 @ (^[Z0/* 24 */:$i]:(esk1_1 @ X13 @ (esk2_1 @ X13 @ Z0))))|~(X13 @ (^[Z0/* 0 */:$i]:(Z0))))&(~(epred1_0 @ (esk1_1 @ X13 @ (esk3_1 @ X13)))|~(X13 @ (^[Z0/* 24 */:$i]:(esk1_1 @ X13 @ (esk2_1 @ X13 @ Z0))))|~(X13 @ (^[Z0/* 0 */:$i]:(Z0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.19/0.51 thf(c_0_3, plain, ![X18:$i]:(((esk5_0 @ X18)=(X18))), introduced(definition)). 0.19/0.51 thf(c_0_4, plain, ![X17:$i, X2:($i > $i) > $o]:(((esk4_1 @ X2 @ X17)=(esk1_1 @ X2 @ (esk2_1 @ X2 @ X17)))), introduced(definition)). 0.19/0.51 thf(c_0_5, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk1_1 @ X2))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])). 0.19/0.51 thf(c_0_6, negated_conjecture, ![X2:($i > $i) > $o]:((~((epred1_0 @ (esk1_1 @ X2 @ (esk3_1 @ X2))))|~((((X2 @ (esk4_1 @ X2)))=(($true))))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3]), c_0_4])). 0.19/0.51 thf(c_0_7, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk1_1 @ X2))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_5])). 0.19/0.51 thf(c_0_8, plain, ![X25:$i]:(((esk5_0 @ X25)=(X25))), inference(variable_rename,[status(thm)],[])). 0.19/0.51 thf(c_0_9, negated_conjecture, ![X2:($i > $i) > $o]:(((epred1_0 @ (esk3_1 @ X2))|~((((X2 @ (esk4_1 @ X2)))=(($true))))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3]), c_0_4])). 0.19/0.51 thf(c_0_10, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk2_1 @ X2))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])). 0.19/0.51 thf(c_0_11, negated_conjecture, ![X2:($i > $i) > $o]:((~((epred1_0 @ (esk1_1 @ X2 @ (esk3_1 @ X2))))|~((X2 @ (esk4_1 @ X2)))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_6])). 0.19/0.51 thf(c_0_12, negated_conjecture, ((esk1_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))))=(esk5_0)), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])). 0.19/0.51 thf(c_0_13, plain, ![X3:$i]:(((esk5_0 @ X3)=(X3))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.19/0.51 thf(c_0_14, negated_conjecture, ![X2:($i > $i) > $o]:(((epred1_0 @ (esk3_1 @ X2))|~((X2 @ (esk4_1 @ X2)))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_9])). 0.19/0.51 thf(c_0_15, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk2_1 @ X2))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_10])). 0.19/0.51 thf(c_0_16, negated_conjecture, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:((((X31 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((X31 @ esk5_0)!=(X32 @ esk5_0))|~((epred1_0 @ (esk1_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))) @ (esk3_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_11])). 0.19/0.51 thf(c_0_17, negated_conjecture, ![X3:$i]:(((esk1_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_12]), c_0_13])). 0.19/0.51 thf(c_0_18, negated_conjecture, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:(((epred1_0 @ (esk3_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))|((X31 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((X31 @ esk5_0)!=(X32 @ esk5_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_14])). 0.19/0.51 thf(c_0_19, plain, ![X23:$i, X24:($i > $i) > $o]:(((esk4_1 @ X24 @ X23)=(esk1_1 @ X24 @ (esk2_1 @ X24 @ X23)))), inference(variable_rename,[status(thm)],[])). 0.19/0.51 thf(c_0_20, negated_conjecture, ((esk2_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))))=(esk5_0)), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15])). 0.19/0.51 thf(c_0_21, plain, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:((((X31 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((^[Z0/* 3 */:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))!=(^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))))|((X31 @ esk5_0)!=(X32 @ esk5_0)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_16, c_0_17])]), c_0_18])). 0.19/0.51 thf(c_0_22, plain, ![X2:($i > $i) > $o, X3:$i]:(((esk4_1 @ X2 @ X3)=(esk1_1 @ X2 @ (esk2_1 @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])). 0.19/0.51 thf(c_0_23, negated_conjecture, ![X3:$i]:(((esk2_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_20]), c_0_13])). 0.19/0.51 thf(c_0_24, plain, ((esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))))!=(esk5_0)), inference(er,[status(thm)],[c_0_21])). 0.19/0.51 thf(c_0_25, plain, ![X3:$i]:(((esk4_1 @ (^[Z0/* 3 */:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_17])). 0.19/0.51 thf(c_0_26, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_24]), c_0_25]), c_0_13])]), ['proof']). 0.19/0.51 # SZS output end CNFRefutation 0.19/0.51 # Parsed axioms : 1 0.19/0.51 # Removed by relevancy pruning/SinE : 0 0.19/0.51 # Initial clauses : 6 0.19/0.51 # Removed in clause preprocessing : 0 0.19/0.51 # Initial clauses in saturation : 6 0.19/0.51 # Processed clauses : 86 0.19/0.51 # ...of these trivial : 1 0.19/0.51 # ...subsumed : 7 0.19/0.51 # ...remaining for further processing : 78 0.19/0.51 # Other redundant clauses eliminated : 8 0.19/0.51 # Clauses deleted for lack of memory : 0 0.19/0.51 # Backward-subsumed : 1 0.19/0.51 # Backward-rewritten : 1 0.19/0.51 # Generated clauses : 129 0.19/0.51 # ...of the previous two non-redundant : 105 0.19/0.51 # ...aggressively subsumed : 0 0.19/0.51 # Contextual simplify-reflections : 3 0.19/0.51 # Paramodulations : 17 0.19/0.51 # Factorizations : 0 0.19/0.51 # NegExts : 24 0.19/0.51 # Equation resolutions : 14 0.19/0.51 # Disequality decompositions : 0 0.19/0.51 # Total rewrite steps : 16 0.19/0.51 # ...of those cached : 0 0.19/0.51 # Propositional unsat checks : 0 0.19/0.51 # Propositional check models : 0 0.19/0.51 # Propositional check unsatisfiable : 0 0.19/0.51 # Propositional clauses : 0 0.19/0.51 # Propositional clauses after purity: 0 0.19/0.51 # Propositional unsat core size : 0 0.19/0.51 # Propositional preprocessing time : 0.000 0.19/0.51 # Propositional encoding time : 0.000 0.19/0.51 # Propositional solver time : 0.000 0.19/0.51 # Success case prop preproc time : 0.000 0.19/0.51 # Success case prop encoding time : 0.000 0.19/0.51 # Success case prop solver time : 0.000 0.19/0.51 # Current number of processed clauses : 57 0.19/0.51 # Positive orientable unit clauses : 9 0.19/0.51 # Positive unorientable unit clauses: 0 0.19/0.51 # Negative unit clauses : 6 0.19/0.51 # Non-unit-clauses : 42 0.19/0.51 # Current number of unprocessed clauses: 31 0.19/0.51 # ...number of literals in the above : 109 0.19/0.51 # Current number of archived formulas : 0 0.19/0.51 # Current number of archived clauses : 21 0.19/0.51 # Clause-clause subsumption calls (NU) : 208 0.19/0.51 # Rec. Clause-clause subsumption calls : 126 0.19/0.51 # Non-unit clause-clause subsumptions : 9 0.19/0.51 # Unit Clause-clause subsumption calls : 24 0.19/0.51 # Rewrite failures with RHS unbound : 0 0.19/0.51 # BW rewrite match attempts : 8 0.19/0.51 # BW rewrite match successes : 2 0.19/0.51 # Condensation attempts : 0 0.19/0.51 # Condensation successes : 0 0.19/0.51 # Termbank termtop insertions : 27715 0.19/0.51 # Search garbage collected termcells : 184 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.018 s 0.19/0.51 # System time : 0.003 s 0.19/0.51 # Total time : 0.021 s 0.19/0.51 # Maximum resident set size: 1928 pages 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.041 s 0.19/0.51 # System time : 0.020 s 0.19/0.51 # Total time : 0.062 s 0.19/0.51 # Maximum resident set size: 1720 pages 0.19/0.51 % E exiting 0.19/0.51 % E exiting 0.19/0.51 EOF